a new algorithm for optimization of fuzzy decision tree in data mining

decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. the resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. the most comprehensible decision trees have been designed for perfect symbolic data. classical crisp decision trees (dt) are widely applied to classification tasks. nevertheless, there are still a lot of problems especially when dealing with numerical (continuous valued) attributes. some of those problems can be solved using fuzzy decision trees (fdt). over the years, additional methodologies have been investigated and proposed to deal with continuous or multi-valued data, and with missing or noisy features. recently, with the growing popularity of fuzzy representation, a few researchers independently have proposed to utilize fuzzy representation in decision trees to deal with similar situations. fuzzy representation bridges the gap between symbolic and non symbolic data by linking qualitative linguistic terms with quantitative data. in this paper, a new method of fuzzy decision trees is presented. this method proposed a new method for handling continuous valued attributes with user defined membership. the results of crisp and fuzzy decision trees are compared at the end.